Some trigonometric identities related to exact covers

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Trigonometric Identities Involving Fibonacci and Lucas Numbers

In this paper, using the number of spanning trees in some classes of graphs, we prove the identities: Fn = 2n−1 n √

متن کامل

List of trigonometric identities

Cosines and sines around the unit circle In mathematics, trigonometric identities are equalities that involve trigonometric functions and are true for every single value of the occurring variables. Geometrically, these are identities involving certain functions of one or more angles. They are distinct from triangle identities, which are identities involving both angles and side lengths of a tri...

متن کامل

A study of inverse trigonometric integrals associated with three-variable Mahler measures, and some related identities

We prove several identities relating three-variable Mahler measures to integrals of inverse trigonometric functions. After deriving closed forms for most of these integrals, we obtain ten explicit formulas for three-variable Mahler measures. Several of these results generalize formulas due to Condon and Laĺın. As a corollary, we also obtain three q-series expansions for the dilogarithm.

متن کامل

Fibonacci numbers and trigonometric identities

Webb & Parberry proved in 1969 a startling trigonometric identity involving Fibonacci numbers. This identity has remained isolated up to now, despite the amount of work on related polynomials. We provide a wide generalization of this identity together with what we believe (and hope!) to be its proper understanding.

متن کامل

Exact Covers via Determinants

Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-dimensional matching problem asks whether there is a disjoint collection of the hyperedges which covers all vertices. We show it can be solved by a randomized polynomial space algorithm in time O(2). The O∗() notation hides factors polynomial in n and k. W...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1991

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-1991-1049133-4